Bloom filter

Results: 180



#Item
51Design Patterns for Tunable and Efficient SSD-based Indexes Ashok Anand† , Aaron Gember-Jacobson*, Collin Engstrom*, Aditya Akella* † Instart Logic *University of Wisconsin-Madison †

Design Patterns for Tunable and Efficient SSD-based Indexes Ashok Anand† , Aaron Gember-Jacobson*, Collin Engstrom*, Aditya Akella* † Instart Logic *University of Wisconsin-Madison †

Add to Reading List

Source URL: agember.com

Language: English - Date: 2014-10-21 17:08:21
522004 IEEE Symposium on Security and Privacy  Large-Scale IP Traceback in High-Speed Internet Jun (Jim) Xu Networking & Telecommunications Group College of Computing

2004 IEEE Symposium on Security and Privacy Large-Scale IP Traceback in High-Speed Internet Jun (Jim) Xu Networking & Telecommunications Group College of Computing

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2004-11-09 21:06:23
53Invertible Bloom Lookup Tables Joe Simons presenting paper by Goodrich and Mitzenmacher  Bloom Filter

Invertible Bloom Lookup Tables Joe Simons presenting paper by Goodrich and Mitzenmacher Bloom Filter

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2012-10-01 19:32:21
54Exegy at TREC 2007 Million Query Track Naveen Singla and Ronald S. Indeck Exegy, Inc. 349, Marshall Avenue, Suite 100, St. Louis, MO 63119, USA. {nsingla, rindeck}@exegy.com

Exegy at TREC 2007 Million Query Track Naveen Singla and Ronald S. Indeck Exegy, Inc. 349, Marshall Avenue, Suite 100, St. Louis, MO 63119, USA. {nsingla, rindeck}@exegy.com

Add to Reading List

Source URL: trec.nist.gov

Language: English
55Journal of Machine Learning Research2637  Submitted 2/09; Revised 8/09; PublishedHash Kernels for Structured Data Qinfeng Shi

Journal of Machine Learning Research2637 Submitted 2/09; Revised 8/09; PublishedHash Kernels for Structured Data Qinfeng Shi

Add to Reading List

Source URL: www.stat.purdue.edu

Language: English - Date: 2010-02-05 11:00:50
56Compressed Representation of Feature Vectors Using a Bloomier Filter and Its Application to Specific Object Recognition Katsufumi Inoue and Koichi Kise Graduate School of Engineering, Osaka Prefecture University 1-1 Gak

Compressed Representation of Feature Vectors Using a Bloomier Filter and Its Application to Specific Object Recognition Katsufumi Inoue and Koichi Kise Graduate School of Engineering, Osaka Prefecture University 1-1 Gak

Add to Reading List

Source URL: www.m.cs.osakafu-u.ac.jp

Language: English - Date: 2009-10-05 04:41:49
57CCCG 2013, Waterloo, Ontario, August 8–10, 2013  Set-Difference Range Queries David Eppstein  ∗

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Set-Difference Range Queries David Eppstein ∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:57
58RESOURCE-EFFICIENT MISBEHAVIOR IDENTIFICATION IN WIRELESS AD HOC NETWORKS by William David Kozma Jr  A Thesis Submitted to the Faculty of the

RESOURCE-EFFICIENT MISBEHAVIOR IDENTIFICATION IN WIRELESS AD HOC NETWORKS by William David Kozma Jr A Thesis Submitted to the Faculty of the

Add to Reading List

Source URL: www2.engr.arizona.edu

Language: English - Date: 2009-05-09 02:32:54
59582  IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 29, NO. 3, MARCH 2011 P2DAP – Sybil Attacks Detection in Vehicular Ad Hoc Networks

582 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 29, NO. 3, MARCH 2011 P2DAP – Sybil Attacks Detection in Vehicular Ad Hoc Networks

Add to Reading List

Source URL: discovery.csc.ncsu.edu

Language: English - Date: 2012-03-12 23:31:44
60REAct: Resource-Efficient Accountability for Node Misbehavior in Ad Hoc Networks based on Random Audits William Kozma Jr. University of Arizona Electrical and Computer Engineering Dept.

REAct: Resource-Efficient Accountability for Node Misbehavior in Ad Hoc Networks based on Random Audits William Kozma Jr. University of Arizona Electrical and Computer Engineering Dept.

Add to Reading List

Source URL: www2.engr.arizona.edu

Language: English - Date: 2009-03-14 14:27:00